#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e2+10;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],dp[maxn][maxn][maxn][maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   LL num1=0;LL num2=0;
   for(LL i=1;i<=n;i++){
       cin>>a[i];
       if(a[i]==0) a[i]=-1;
       else if(a[i]&1) num1++;
       else if(a[i]%2==0) num2++;
   }
   if(n&1){
      num1=(n+1)/2-num1;
      num2=n/2-num2;
   }
   else if(n%2==0){
      num1=n/2-num1;
      num2=n/2-num2;
   }
   memset(dp,0x3f,sizeof(dp));
   ///dp[0][0][0]=0;

   for(LL i=1;i<=n;i++){
      for(LL last=0;last<=1;last++){
          for(LL j=0;j<=num1;j++){
              for(LL k=0;k<=num2;k++){
                  if(a[i]==-1){

                  }
                  else if(a[i]&1){
                     dp[i][]
                  }
                  else if(a[i]%2==0){

                  }
              }
          }
      }
   }
   return 0;
}
